منابع مشابه
A Constructive Enumeration of Fullerenes
In this paper, a fast and complete method to enumerate fullerene structures is given. It is based on a top-down approach, and it is fast enough to generate, for example, all 1812 isomers of C60 in less than 20 seconds on an SGI-workstation. The method described can easily be generalised for 3-regular spherical maps with no face having more than 6 edges in its boundary. 3 Symbols: P : A calligra...
متن کاملConstructive Enumeration of Chiral Isomers of Alkanes*
The problem of exhaustive and non-redundant generation of formulas of chiral isomers of alkanes was considered. The procedure starts with the generation of optimal codes of all N-alkane structures (N denotes the number of carbon atoms.) and then the algorithm determines whether a given structure contains at least a single carbon atom, with four different substituents. In order to accomplish the...
متن کاملA constructive enumeration of fusenes and benzenoids
In this paper, a fast and complete method to constructively enumerate fusenes and benzenoids is given. It is fast enough to construct several million non isomorphic structures per second. The central idea is to represent fusenes as labelled inner duals and generate them in a two step approach using the canonical construction path method and the homomorphism principle.
متن کاملEnumeration of cospectral graphs
We have enumerated all graphs on at most 11 vertices and determined their spectra with respect to various matrices, such as the adjacency matrix and the Laplacian matrix. We have also counted the numbers for which there is at least one other graph with the same spectrum (a cospectral mate). In addition we consider a construction for pairs of cospectral graphs due to Godsil and McKay, which we c...
متن کاملEnumeration of Difference Graphs
A difference graph is a bipartite graph G = (X, Y: E) such that all the neighborhoods of the vertices of X are comparable by inclusion. We enumerate labeled and unlabeled difference graphs with or without a bipartition of the vertices into two stable sets. The labeled enumerations are expressed in terms of combinatorial numbers related to the Stirling numbers of the second kind.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1988
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700027398